An Algebraic Formalization of the GoF Design Patterns
نویسندگان
چکیده
Abstract This document reports on the use of an algebraic, visual, formal approach to the specification of patterns for the formalization of the GoF design patterns. The approach is based on graphs, morphisms and operations from category theory and exploits triple graphs to annotate model elements with pattern roles. Being based on category theory, the approach can be applied to formalize patterns in different domains. Novel in our proposal is the possibility of describing (nested) variable submodels, inter-pattern synchronization across several diagrams (e.g. class and sequence diagrams for UML design patterns), pattern composition, and conflict analysis.
منابع مشابه
Securing Gang of Four Design Patterns
Software design patterns are a means to specify common solutions to reoccurring design problems. Similarly, security design patterns provide a means to encapsulate common security solutions and mechanisms which are applicable at the design phase of the software development lifecycle. Security patterns have received considerable attention from the security community to introduce concepts such as...
متن کاملSoftware Engineering Paradigm Independent Design Problems, GoF 23 Design Patterns, and Aspect Design
The aim of the paper is to investigate applicability of object-oriented software design patterns in the context of aspect-oriented design. The paper analyses which of the GoF 23 patterns have a meaning in this context and how they are affected by it. The main assumption is that there exist design patterns that solve software engineering paradigm independent design problems and that such pattern...
متن کاملAlgebraic Matching of Vulnerabilities in a Low-Level Code
This paper explores the algebraic matching approach for detection of vulnerabilities in binary codes. The algebraic programming system is used for implementing this method. It is anticipated that models of vulnerabilities and programs to be verified are presented as behavior algebra and action language specifications. The methods of algebraic matching are based on rewriting rules and techniques...
متن کاملAn Algebraic Theory
We give an algebraic formalization of SLD-trees and their abstractions (ob-servables). We can state and prove in the framework several useful theorems (AND-compositionality, correctness and full abstraction of the denotation, equivalent top-down and bottom-up constructions) about semantic properties of various observables. Observables are represented by Galois co-insertions and can be used to m...
متن کاملAn Algebraic Theory of Observables
We give an algebraic formalization of SLD-trees and their abstractions (ob servables). We can state and prove in the framework several useful theorems (AND-compositionality, correctness and full abstraction of the denotation, equivalent top-down and bottom-up constructions) about semantic properties of various observables. Observables are represented by Galois co-insertions and can be used to m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1003.3338 شماره
صفحات -
تاریخ انتشار 2010